A Comparison of Pivoting Strategies for the Direct LU Factorization

We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usual Gaussian elimination and show that two so-called total scaled and total pivoting strategies can be employed in addition to the traditional pivoting strategies: partial scaled, partial, and direct diagonal. In this paper we o er a general LU factorization with total scaled pivoting algorithm from which the other well-known pivoting and non-pivoting algorithms can be driven. We utilize the random number routines in MSU-Billings' main frame computer to compare these pivoting strategies and conclude that none of the ve strategies is absolutely more accurate than the other but generally their accuracy desending order is the same as their appearing order in the above.